A Construction for Sets of Integers with Distinct Subset Sums
نویسنده
چکیده
A set S of positive integers has distinct subset sums if there are 2|S| distinct elements of the set {∑ x∈X x : X ⊂ S } . Let f(n) = min{maxS : |S| = n and S has distinct subset sums}. Erdős conjectured f(n) ≥ c2n for some constant c. We give a construction that yields f(n) < 0.22002 · 2n for n sufficiently large. This now stands as the best known upper bound on f(n).
منابع مشابه
A Generalization of a Subset - Sum - Distinct Sequence
In 1967, as an answer to the question of P. Erdös on a set of integers having distinct subset sums, J. Conway and R. Guy constructed an interesting sequence of sets of integers. They conjectured that these sets have distinct subset sums and that they are close to the best possible with respect to the largest element. About 30 years later (in 1996), T. Bohman could prove that sets from the Conwa...
متن کاملInverse Theorems for Subset Sums
Let A be a nite set of integers. For h 1, let S h (A) denote the set of all sums of h distinct elements of A. Let S(A) denote the set of all nonempty sums of distinct elements of A. The direct problem for subset sums is to nd lower bounds for jS h (A)j and jS(A)j in terms of jAj. The inverse problem for subset sums is to determine the structure of the extremal sets A of integers for which jS h ...
متن کاملSums of lexicographically ordered sets
We consider the problem of determining finite integer sets which are knapsack-solvable in linear time (that is, it is possible to determine in linear time, for any integer b, whether b can be expressed as a sum of distinct elements of that set) and where the largest element is as small as possible. We study the condition that the k-subsets (for fixed k) when lexicographically ordered have incre...
متن کاملConstructing MSTD Sets Using Bidirectional Ballot Sequences
A more sums than differences (MSTD) set is a finite subset S of the integers such that |S + S| > |S − S|. We construct a new dense family of MSTD subsets of {0, 1, 2, . . . , n − 1}. Our construction gives Θ(2n/n) MSTD sets, improving the previous best construction with Ω(2/n) MSTD sets by Miller, Orosz, and Scheinerman.
متن کاملNewman polynomials with prescribed vanishing and integer sets with distinct subset sums
We study the problem of determining the minimal degree d(m) of a polynomial that has all coefficients in {0, 1} and a zero of multiplicity m at −1. We show that a greedy solution is optimal precisely when m ≤ 5, mirroring a result of Boyd on polynomials with ±1 coefficients. We then examine polynomials of the form ∏ e∈E(x e+ 1), where E is a set of m positive odd integers with distinct subset s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 5 شماره
صفحات -
تاریخ انتشار 1998